1 8 N ov 2 00 8 Note on generating all subsets of a finite set with disjoint unions
نویسنده
چکیده
We call a family G ⊂ P[n] a k-generator of P[n] if every x ⊂ [n] can be expressed as a union of at most k disjoint sets in G. Frein, Lévêque and Seb˝ o [1] conjectured that for any n ≥ k, such a family must be at least as large as the k-generator obtained by taking a partition of [n] into classes of sizes as equal as possible, and taking the union of the power-sets of the classes. We generalize a theorem of Alon and Frankl [2] in order to show that for fixed k, any k-generator of P[n] must have size at least k2 n/k (1 − o(1)), thereby verifying the conjecture asymptotically for multiples of k.
منابع مشابه
2 1 N ov 2 00 8 Note on generating all subsets of a finite set with disjoint unions
We call a family G ⊂ P[n] a k-generator of P[n] if every x ⊂ [n] can be expressed as a union of at most k disjoint sets in G. Frein, Lévêque and Seb˝ o [1] conjectured that for any n ≥ k, such a family must be at least as large as the k-generator obtained by taking a partition of [n] into classes of sizes as equal as possible, and taking the union of the power-sets of the classes. We generalize...
متن کاملNote on Generating All Subsets of a Finite Set with Disjoint Unions
We call a family G ⊂ P[n] a k-generator of P[n] if every x ⊂ [n] can be expressed as a union of at most k disjoint sets in G. Frein, Lévêque and Sebő [1] conjectured that for any n ≥ k, such a family must be at least as large as the k-generator obtained by taking a partition of [n] into classes of sizes as equal as possible, and taking the union of the power-sets of the classes. We generalize a...
متن کاملGenerating all subsets of a finite set with disjoint unions
If X is an n-element set, we call a family G ⊂ PX a k-generator for X if every x ⊂ X can be expressed as a union of at most k disjoint sets in G. Frein, Lévêque and Sebő [10] conjectured that for n > 2k, the smallest k-generators for X are obtained by taking a partition of X into classes of sizes as equal as possible, and taking the union of the power-sets of the classes. We prove this conjectu...
متن کاملOn Partitioning Sidon Sets with Quasi-independent Sets
There is a construction of random subsets of Z in which almost every subset is Sidon (this was first done by Katznelson). More is true: almost every subset is the finite union of quasi-independent sets. Also, if every Sidon subset of Z\{0} is the finite union of quasi-independent sets, then the required number of quasi-independent sets is bounded by a function of the Sidon constant. Analogs of ...
متن کاملConstructing union-free pairs of k-element subsets
It is proved that one can choose ⌊ 1 2 ( n k )⌋ disjoint pairs of k-element subsets of an n-element set in such a way that the unions of the pairs are all different, supposing that n > n(k).
متن کامل